منابع مشابه
Nonconvex Minimization Problems
I. The central result. The grandfather of it all is the celebrated 1961 theorem of Bishop and Phelps (see [7], [8]) that the set of continuous linear functionals on a Banach space E which attain their maximum on a prescribed closed convex bounded subset X c E is norm-dense in £*. The crux of the proof lies in introducing a certain convex cone in E, associating with it a partial ordering, and ap...
متن کاملA Nonconvex Relaxation Approach for Rank Minimization Problems
Recently, solving rank minimization problems by leveraging nonconvex relaxations has received significant attention. Some theoretical analyses demonstrate that it can provide a better approximation of original problems than convex relaxations. However, designing an effective algorithm to solve nonconvex optimization problems remains a big challenge. In this paper, we propose an Iterative Shrink...
متن کاملProximal alternating linearized minimization for nonconvex and nonsmooth problems
We introduce a proximal alternating linearized minimization (PALM) algorithm for solving a broad class of nonconvex and nonsmooth minimization problems. Building on the powerful KurdykaLojasiewicz property, we derive a self-contained convergence analysis framework and establish that each bounded sequence generated by PALM globally converges to a critical point. Our approach allows to analyze va...
متن کاملAlternating minimization and projection methods for structured nonconvex problems
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : R → R∪{+∞} and g : R → R∪{+∞} are proper lower semicontinuous functions, and Q : R × R → R is a smooth C function which couples the variables x and y. The algorithm can be viewed as a proximal regularization of the usual Gau...
متن کاملSolutions and Optimality Criteria to Box Constrained Nonconvex Minimization Problems
This paper presents a canonical duality theory for solving nonconvex polynomial programming problems subjected to box constraints. It is proved that under certain conditions, the constrained nonconvex problems can be converted to the so-called canonical (perfect) dual problems, which can be solved by deterministic methods. Both global and local extrema of the primal problems can be identified b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1979
ISSN: 0273-0979
DOI: 10.1090/s0273-0979-1979-14595-6